Proximal Operator Splitting for Multi-Constraint Dictionary Learning
نویسندگان
چکیده
منابع مشابه
Proximal Methods for Sparse Hierarchical Dictionary Learning
We propose to combine two approaches for modeling data admitting sparse representations: on the one hand, dictionary learning has proven effective for various signal processing tasks. On the other hand, recent work on structured sparsity provides a natural framework for modeling dependencies between dictionary elements. We thus consider a tree-structured sparse regularization to learn dictionar...
متن کاملProximal alternating algorithms in dictionary learning
In recent years, sparse coding has been widely used in many applications ranging from image processing to pattern recognition. Most existing sparse coding based applications require solving a class of challenging non-smooth and non-convex optimization problems. In this talk, I will review some proximal alternating algorithms for solving such problem and give rigorous convergence analysis. Exper...
متن کاملDictionary learning under global sparsity constraint
A new method is proposed in this paper to learn overcomplete dictionary from training data samples. Differing from the current methods that enforce similar sparsity constraint on each of the input samples, the proposed method attempts to impose global sparsity constraint on the entire data set. This enables the proposed method to fittingly assign the atoms of the dictionary to represent various...
متن کاملProximal Methods for Sparse Hierarchical Dictionary Learning: Supplementary Materials
We show in this paper that Eq. (1) can be solved exactly in linear time. The procedure aims at solving a dual formulation of Eq. (1) involving the dual norm of ‖.‖ denoted by ‖.‖∗ and defined as ‖κ‖∗ = max‖z‖≤1 zκ for any vector κ in R. We first derive a dual problem based on conic duality [Boyd and Vandenberghe, 2004]. The rationale for using conic duality is to come up with a dual problem wit...
متن کاملProximal Methods for Sparse Hierarchical Dictionary Learning: Supplementary Materials
We show in this paper that Eq. (1) can be solved exactly in linear time. The procedure aims at solving a dual formulation of Eq. (1) involving the dual norm of ‖.‖ denoted by ‖.‖∗ and defined as ‖κ‖∗ = max‖z‖≤1 zκ for any vector κ in R. We first derive a dual problem based on conic duality [Boyd and Vandenberghe, 2004]. The rationale for using conic duality is to come up with a dual problem wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Hybrid Information Technology
سال: 2017
ISSN: 1738-9968,1738-9968
DOI: 10.14257/ijhit.2017.10.2.11